BCYCLIC: A parallel block tridiagonal matrix cyclic solver
نویسندگان
چکیده
منابع مشابه
BCYCLIC: A parallel block tridiagonal matrix cyclic solver
A block tridiagonal matrix is factored with minimal fill-in using a cyclic reduction algorithm that is easily parallelized. Storage of the factored blocks allows the application of the inverse to multiple right-hand sides which may not be known at factorization time. Scalability with the number of block rows is achieved with cyclic reduction, while scalability with the block size is achieved us...
متن کاملA versatile parallel block-tridiagonal solver for spectral codes
Three-dimensional (3-D) processor configuration of a parallel solver is introduced to solve a massive block-tridiagonal matrix system in this paper. The purpose of the added parallelization dimension is to retard the saturation of the scaling due to communication overhead and an inefficient parallelization. The semi-empirical formula for the matrix operation count of the typical parallel algori...
متن کاملA Parallel Fast Direct Solver for Block Tridiagonal Systemswith
A parallel fast direct solver based on the Divide & Conquer method for linear systems with separable block tridiagonal matrices is considered. Such systems appear, for example, when discretizing the Poisson equation in a rectangular domain using the ve{point nite diierence scheme or the piecewise linear nite elements on a triangulated rectangular mesh. The Divide & Conquer method has the arithm...
متن کاملParallel Cholesky Factorization of a Block Tridiagonal Matrix
In this paper we discuss the parallel implementation of the Cholesky factorization of a positive definite symmetric matrix when that matrix is block tridiagonal. While parallel implementations for this problem, and closely related problems like the factorization of banded matrices, have been previously reported in the literature, those implementations dealt with the special cases where the bloc...
متن کاملA Memory Efficient Parallel Tridiagonal Solver
We present a memory efficient parallel algorithm for the solution of tridiagonal linear systems of equations that are diagonally dominant on a very large number of processors. Our algorithm can be viewed as a parallel partitioning algorithm. We illustrate its performance using some examples. Based on this partitioning algorithm, we introduce a recursive version that has logarithmic communicatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2010
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2010.04.049